Gene expression modeling through positive boolean functions
نویسندگان
چکیده
منابع مشابه
Gene expression modeling through positive boolean functions
In the framework of gene expression data analysis, the selection of biologically relevant sets of genes and the discovery of new subclasses of diseases at bio-molecular level represent two significant problems. Unfortunately, in both cases the correct solution is usually unknown and the evaluation of the performance of gene selection and clustering methods is difficult and in many cases unfeasi...
متن کاملModeling gene expression data via positive Boolean functions
In this work we propose an artificial model for the generation of biologically plausible gene expression data to be used in the evaluation of the performance of gene selection and clustering methods. The model allows to fix in advance the set of relevant genes and the functional classes involved in the problem; the input-output relationship is constructed by synthesizing a positive Boolean func...
متن کاملApproximation Properties of Positive Boolean Functions
The universal approximation property is an important characteristic of models employed in the solution of machine learning problems. The possibility of approximating within a desired precision any Borel measurable function guarantees the generality of the considered approach. The properties of the class of positive Boolean functions, realizable by digital circuits containing only and and or por...
متن کاملRecognition of Positive 2-Interval Boolean Functions
Boolean function f on n variables is represented by set I of disjoint intervals of non-negative n-bit integers, if the following condition holds: vector x of length n is a truepoint of f , if and only if integer x, binary representation of which corresponds to vector x, belongs to some interval from I. In this paper we present a polynomial-time algorithm recognizing, whether a Boolean function ...
متن کاملDual Subimplicants of Positive Boolean Functions∗
Given a positive Boolean function f and a subset ∆ of its variables, we give a combinatorial condition characterizing the existence of a prime implicant D̂ of the Boolean dual fd of f , having the property that every variable in ∆ appears in D̂. We show that the recognition of this property is an NP-complete problem, suggesting an inherent computational difficulty of Boolean dualization, independ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2008
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2007.03.010